Distinguishing Chromatic Numbers of Bipartite Graphs
نویسندگان
چکیده
Extending the work of K. L. Collins and A.N. Trenk, we characterize connected bipartite graphs with large distinguishing chromatic number. In particular, if G is a connected bipartite graph with maximum degree ∆ ≥ 3, then χD(G) ≤ 2∆ − 2 whenever G 6∼= K∆−1,∆, K∆,∆.
منابع مشابه
The distinguishing chromatic number of bipartite graphs of girth at least six
The distinguishing number $D(G)$ of a graph $G$ is the least integer $d$ such that $G$ has a vertex labeling with $d$ labels that is preserved only by a trivial automorphism. The distinguishing chromatic number $chi_{D}(G)$ of $G$ is defined similarly, where, in addition, $f$ is assumed to be a proper labeling. We prove that if $G$ is a bipartite graph of girth at least six with the maximum ...
متن کاملVertex-distinguishing IE-total colorings of complete bipartite graphs Km, n(m<n)
Let G be a simple graph. An IE-total coloring f of G is a coloring of the vertices and edges of G so that no two adjacent vertices receive the same color. Let C(u) be the set of colors of vertex u and edges incident to u under f . For an IE-total coloring f of G using k colors, if C(u) 6= C(v) for any two different vertices u and v of G, then f is called a k-vertex-distinguishing IE-total-color...
متن کاملThe Gap between the Chromatic number and the Distinguishing Chromatic Number
The Distinguishing Chromatic Number of a graph G, denoted χD(G), was first defined in [5] as the minimum number of colors needed to properly color G such that no non-trivial automorphism φ of the graph G fixes each color class of G. In this paper, we consider certain ‘natural’ families of bipartite graphs that have reasonably large automorphism groups and we show that in all those cases, the di...
متن کاملOn the set of circular total chromatic numbers of graphs
For every integer r > 3 and every ε > 0 we construct a graph with maximum degree r − 1 whose circular total chromatic number is in the interval (r, r + ε). This proves that (i) every integer r > 3 is an accumulation point of the set of circular total chromatic numbers of graphs, and (ii) for every ∆ > 2, the set of circular total chromatic numbers of graphs with maximum degree ∆ is infinite. Al...
متن کاملDistinguishing and Distinguishing Chromatic Numbers of Generalized Petersen Graphs
Albertson and Collins defined the distinguishing number of a graph to be the smallest number of colors needed to color its vertices so that the coloring is preserved only by the identity automorphism. Collins and Trenk followed by defining the distinguishing chromatic number of a graph to be the smallest size of a coloring that is both proper and distinguishing. We show that, with two exception...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Electr. J. Comb.
دوره 16 شماره
صفحات -
تاریخ انتشار 2009